Distance spectra and distance energy of integral circulant graphs
نویسندگان
چکیده
منابع مشابه
Distance spectra and Distance energy of Integral Circulant Graphs
The distance energy of a graph G is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of G. There was a vast research for the pairs and families of non-cospectral graphs having equal distance energy, and most of these constructions were based on the join of graphs. A graph is called circulant if it is Cayley graph on the ...
متن کاملDistance magic circulant graphs
Let G = (V,E) be a graph of order n. A distance magic labeling of G is a bijection l : V → {1, 2, . . . , n} for which there exists a positive integer k such that ∑ x∈N(v) l(x) = k for all v ∈ V , where N(v) is the open neighborhood of v. In this paper we deal with circulant graphs C(1, p). The circulant graph Cn(1, p) is the graph on the vertex set V = {x0, x1, . . . , xn−1} with edges (xi, xi...
متن کاملReciprocal complementary distance spectra and reciprocal complementary distance energy of line graphs of regular graphs
The reciprocal complementary distance (RCD) matrix of a graphG is defined asRCD(G) = [rcij] where rcij = 1 1+D−dij if i 6= j and rcij = 0, otherwise, where D is the diameter of G and dij is the distance between the vertices vi and vj in G. The RCD-energy of G is defined as the sum of the absolute values of the eigenvalues of RCD(G). Two graphs are said to be RCDequienergetic if they have same R...
متن کاملIntegral Distance Graphs
Suppose D is a subset of all positive integers. The distance graph G(Z,D) with distance set D is the graph with vertex set Z, and two vertices x and y are adjacent if and only if |x− y| ∈ D. This paper studies the chromatic number χ(Z,D) of G(Z,D). In particular, we prove that χ(Z,D) ≤ |D|+1 when |D| is finite. Exact values of χ(G,D) are also determined for some D with |D| = 3. c © 1997 John Wi...
متن کاملDistance-Hereditary Embeddings of Circulant Graphs
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belonging to this set have the same length and their diameter corresponds to the diameter of the chordal ring in which they are embedded. The members of this embedded set of rings are non-disjoint and preserve the minimal routi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.04.034